Edge Disjoint Polyp Packing
نویسنده
چکیده
A graph is called a p{polyp if it consists of p simple paths of the same length and one endvertex of all these paths is a common vertex. The Polyp Packing problem is a generalization of the well known Bin Packing problem: How to pack a set of paths with diierent lengths to a set of polyps edge disjointly? It is proved that the Polyp Packing problem is NP-complete and that a modiication of the First Fit algorithm gives a reasonable approximation.
منابع مشابه
A note on careful packing of a graph
Let G be a simple graph of order n and size e(G). It is well known that if e(G) ≤ n− 2, then there is an edge–disjoint placement of two copies of G into Kn. We prove that with the same condition on size of G we have actually (with few exceptions) a careful packing of G, that is an edge–disjoint placement of two copies of G into Kn \ Cn.
متن کاملA note on packing spanning trees in graphs and bases in matroids
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide descriptions of such graphs and matroids, showing that such a graph (or matroid) has a unique decomposition. In the case of graphs, our results are releva...
متن کاملOn packing spanning trees in graphs and bases in matroids
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide structural descriptions of such graphs and matroids. In the case of graphs, our results are relevant for certain communication protocols.
متن کاملPacking and Covering Triangles in K 4-free Planar Graphs
We show that every K4-free planar graph with at most ν edge-disjoint triangles contains a set of at most 32ν edges whose removal makes the graph triangle-free. Moreover, equality is attained only when G is the edge-disjoint union of 5-wheels plus possibly some edges that are not in triangles. We also show that the same statement is true if instead of planar graphs we consider the class of graph...
متن کاملHamilton decompositions of regular expanders: Applications
In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this theorem is that every regular tournament on n vertices can be decomposed into (n − 1)/2 edge-disjoint Hamilton cycles, whenever n is sufficiently large. This v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 78 شماره
صفحات -
تاریخ انتشار 1997